An Improvement to the Gaudry-Schost Algorithm for Multidimensional Discrete Logarithm Problems
نویسندگان
چکیده
Gaudry and Schost gave a low-memory algorithm for solving the 2-dimensional discrete logarithm problem. We present an improvement to their algorithm and extend this improvement to the general multidimensional DLP. An important component of the algorithm is a multidimensional pseudorandom walk which we analyse thoroughly in the 1 and 2 dimensional cases as well as giving some discussion for higher dimensions.
منابع مشابه
Collision of Random Walks and a Refined Analysis of Attacks on the Discrete Logarithm Problem
Some of the most efficient algorithms for finding the discrete logarithm involve pseudo-random implementations of Markov chains, with one or more “walks” proceeding until a collision occurs, i.e. some state is visited a second time. In this paper we develop a method for determining the expected time until the first collision. We use our technique to examine three methods for solving discrete-lo...
متن کاملComputing discrete logarithms in an interval
The discrete logarithm problem in an interval of size N in a group G is: Given g, h ∈ G and an integer N to find an integer 0 ≤ n ≤ N , if it exists, such that h = gn. Previously the best low-storage algorithm to solve this problem was the van Oorschot and Wiener version of the Pollard kangaroo method. The heuristic average case running time of this method is (2 + o(1)) √ N group operations. We...
متن کاملUsing Equivalence Classes to Accelerate Solving the Discrete Logarithm Problem in a Short Interval
The Pollard kangaroo method solves the discrete logarithm problem (DLP) in an interval of size N with heuristic average case expected running time approximately 2 √ N group operations. A recent variant of the kangaroo method, requiring one or two inversions in the group, solves the problem in approximately 1.71 √ N group operations. It is well-known that the Pollard rho method can be sped-up by...
متن کاملComputing discrete logarithms in the Jacobian of high-genus hyperelliptic curves over even characteristic finite fields
We describe improved versions of index-calculus algorithms for solving discrete logarithm problems in Jacobians of high-genus hyperelliptic curves de ned over even characteristic elds. Our rst improvement is to incorporate several ideas for the low-genus case by Gaudry and Theriault, including the large prime variant and using a smaller factor base, into the large-genus algorithm of Enge and Ga...
متن کاملIndex calculus for abelian varieties and the elliptic curve discrete logarithm problem
We propose an index calculus algorithm for the discrete logarithm problem on general abelian varieties. The main difference with the previous approaches is that we do not make use of any embedding into the Jacobian of a well-suited curve. We apply this algorithm to the Weil restriction of elliptic curves and hyperelliptic curves over small degree extension fields. In particular, our attack can ...
متن کامل